An Eecient Fault-tolerant Routing Scheme for Two Dimensional Meshes

نویسندگان

  • Vara Varavithya
  • Jatin Upadhyay
  • Prasant Mohapatra
چکیده

Most of the previously proposed fault-tolerant wormhole routing algorithms for direct networks are extensions of the existing adaptive routing algorithms. These extensions are usually done by adding extra virtual channels to the network. Since these additional virtual channels are used for the fault tolerance purposes , they are not eeciently utilized when there are no faults in the network. In this paper, we propose a new fault-tolerant routing scheme for 2-dimensional mesh networks. It provides alternate physical paths to a message until it reaches the last dimension. While routing in the last dimension, if the message encounters a faulty node, it is stored completely at the adjacent node and is retransmitted. Using this routing scheme no adaptivity is sacriiced when there are no faults in the network and no additional virtual channels are required for fault tolerance. The performance of the proposed scheme is better than the previously proposed fcube algorithm which uses the same number of virtual channels. The eeect of number and location of faults on the latency and the utilization is also studied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fault-tolerant Adaptive and Minimal Routing Scheme in $n$-D Meshes

In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an early work of the author on minimal routing in low-dimensional meshes (such as 2-D meshes with faulty blocks). Unlike many traditional models that assume all the nodes know global fault distribution, our approach is bas...

متن کامل

A Fault-Tolerant Adaptive and Minimal Routing Approach in 3-D Meshes

In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an early work of the author on minimal routing in low dimension meshes (such as 2-D meshes with faulty blocks). Unlike many traditional models that assume all the nodes know global fault distribution, our approach is based...

متن کامل

Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes

We present an adaptive deadlock-free routing algorithm which decomposes a given network into two virtual interconnection networks, V IN 1 and V IN 2. V IN 1 supports deterministic deadlock-free routing, and V IN 2 supports fully-adaptive routing. Whenever a channel in V IN 1 or V IN 2 is available, it can be used to route a message. Each node is identiied to be in one of three states: safe, uns...

متن کامل

Fault-Tolerant Adaptive and Minimal Routing in Mesh-Connected Multicomputers Using Extended Safety Levels

ÐThe minimal routing problem in mesh-connected multicomputers with faulty blocks is studied, Two-dimensional meshes are used to illustrate the approach. A sufficient condition for minimal routing in 2D meshes with faulty blocks is proposed. Unlike many traditional models that assume all the nodes know global fault distribution, our approach is based on the concept of an extended safety level, w...

متن کامل

A Compact Fault-tolerant, Deadlock-free, Minimal Routing Algorithm for n-Dimensional Wormhole Switching Based Meshes

To satisfy the ever increasing demand for computational power, massively parallel computers are mandatory. Such machines require a compact routing scheme for scalability as well as an optimal routing algorithm to minimize the communication delay. Combination of both requirements is reported for fault-free regular structures only . Yet in massively parallel machines the probability of failures b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995